Euler Cycles inK2mPlus Perfect Matching

Treasure Hunting Perfect Euler bricks

An Euler brick is a cuboid with integer side dimensions such that the face diagonals are integers. Already in 1740, families of Euler bricks have been found. Euler himself constructed more families. If the space diagonal of an Euler brick is an integer too, an Euler brick is called a perfect Euler brick. Nobody has found one. There might be none. Nevertheless, it is an entertaining sport to go ...

Cycles and perfect matchings

Fan Chung and Ron Graham (J. Combin. Theory Ser. B 65 (1995), 273-290) introduced the cover polynomial for a directed graph and showed that it was connected with classical rook theory. M. Dworkin (J. Combin. Theory Ser. B 71 (1997), 17-53) showed that the cover polynomial naturally factors for directed graphs associated with Ferrers boards. The authors (Adv. Appl. Math. 27 (2001), 438-481) deve...

Perfect Matching Preservers

For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.

Perfect Matching Disclosure Attacks

Traffic analysis is the best known approach to uncover relationships amongst users of anonymous communication systems, such as mix networks. Surprisingly, all previously published techniques require very specific user behavior to break the anonymity provided by mixes. At the same time, it is also well known that none of the considered user models reflects realistic behavior which casts some dou...

Srikumar 1 Perfect Matching and Matching Polytopes